Games with guaranteed scores and waiting moves

Combinatorial scoring games, with the property ‘extra pass moves for a player will do him no harm’, are characterized. The characterization involves an order embedding of Conway’s normal play games, and we call our class the universe of Guaranteed scoring games. Also, we give a theorem for comparing guaranteed games with scores (numbers) which extends Ettinger’s work on Dicot scoring games.     

Optimization of Fishing Strategies in Space and Time as a Non-convex Optimal Control Problem

The behavior of a fishing fleet and its impact onto the biomass of fish can be described by a nonlinear parabolic diffusion–reaction equation. Looking for an optimal fishing strategy leads to a non-convex optimal control problem with a bilinear control action. In this work, we present such an optimal control formulation, prove its well-posedness and derive first- and second-order optimality conditions. These results provide a basis for tailored finite element discretization as well as for Newton type optimization algorithms. First numerical test problems show typical features as so-called No-Take-Zones and maximal fishing quota (total allowable catches) as parts of an optimal fishing strategy.     

Higher dimensional Apollonian packings,revisited

The Apollonian circle and sphere packings are well known objects that have attracted the attention of mathematicians throughout the ages. The historically natural generalization of the procedure for generating the packing breaks down in higher dimensions, as it leads to overlapping hyperspheres. There is, however, an alternative interpretation that allows one to extend the concept to higher dimensions and in a unique way. For relatively small dimensions (2 through at least 8), those packings can be thought of as ample cones for classes of K3 surfaces. We describe the packings in some detail for dimensions 4 (with plenty of pictures), 5, and 6.     

On the Strong Convergence of Subgradients of Convex Functions

In this paper, results on the strong convergence of subgradients of convex functions along a given direction are presented; that is, the relative compactness (with respect to the norm) of the union of subdifferentials of a convex function along a given direction is investigated.     

Diversity-oriented synthesis and antifungal activities of novel pimprinine derivative bearing a 1,3,4-oxadiazole-5-thioether moiety

Molecular Diversity - Based on the strategy of diversity-oriented synthesis and the structures of natural product pimprinine and streptochlorin, two series of novel pimprinine derivatives...     

磷酸酯类前药的合成方法与应用

磷酸酯类前药与原药相比,不仅能够提高药物靶向性、稳定性和生物利用度,减少药物毒副作用,还能掩蔽药物不适气味、提高水溶性从而改善给药途径。含羟基药物的磷酸酯化是该类药物前药设计的重要方法之一。本文根据中心磷原子的价态和化合物结构进行分类,综述了各种P(Ⅴ)四配位分子、P(Ⅲ)三配位分子和H-亚磷酸酯类化合物作为磷酸酯化试剂在磷酸酯类前药合成方法中的研究进展,并阐述了这些磷酸酯类药物的应用,最后总结了各类磷酸酯化试剂的优势与局限,并结合连续流反应技术应用案例展望了其发展趋势。     

Reflections on and of minor-closed classes of multisorted operations

The minor relation of functions is generalized to multisorted functions. Pippenger’s Galois theory for minor-closed sets of functions is extended to multisorted functions and multisorted relation pairs. Reflections of minor-closed sets are again minor-closed, and the effect of reflections on the invariant relation pairs of minor-closed sets of multisorted functions is described.     

Another refinement of the right-hand side of the Hermite–Hadamard inequality for simplices

We establish a new refinement of the right-hand side of the Hermite–Hadamard inequality for convex functions of several variables defined on simplices.     

Constrained Extremum Problems and Image Space Analysis–Part I: Optimality Conditions

Image space analysis is a new tool for studying scalar and vector constrained extremum problems as well as generalized systems. In the last decades, the introduction of image space analysis has shown that the image space associated with the given problem provides a natural environment for the Lagrange theory of multipliers and that separation arguments turn out to be a fundamental mathematical tool for explaining, developing and improving such a theory. This work, with its 3 parts, aims at contributing to describe the state-of-the-art of image space analysis for constrained optimization and to stress that it allows us to unify and generalize the several topics of optimization. In this 1st part, after a short introduction of such an analysis, necessary and sufficient optimality conditions are treated. Duality and penalization are the contents of the 2nd part. The 3rd part deals with generalized systems, in particular, variational inequalities and Ky Fan inequalities. Some further developments are discussed in all the parts.